package edu.whu.rose.clock.kps.spindex;

public class ShortestPathInSubgraph {

	private int[][] distances;
	private int[][] predecessors;
	
	public int[] getDistances(int index) {
		return distances[index];
	}
	public void setDistances(int[][] distances) {
		this.distances = distances;
	}
	public int[] getPredecessors(int index) {
		return predecessors[index];
	}
	public void setPredecessors(int[][] predecessors) {
		this.predecessors = predecessors;
	}

}
